Tolerating Stop Failures in Distributed Maple
نویسندگان
چکیده
منابع مشابه
Subtleties in Tolerating Correlated Failures
High availability is widely accepted as an explicit requirement for distributed storage systems. Tolerating correlated failures is a key issue in achieving high availability in today’s wide-area environments. This paper systematically revisits previously proposed techniques for addressing correlated failures. Using a combination of experimental and mathematical analysis of several real-world fa...
متن کاملEfficient Wait-Free Implementation of a Concurrent Priority Queue
Binary snapshots p. 18 Linear-time snapshot protocols for unbalanced systems p. 26 Towards a necessary and sufficient condition for wait-free synchronization p. 39 Efficient algorithms for checking the atomicity of a run of read and write operations p. 54 Benign failure models for shared memory p. 69 Generalized agreement between concurrent fail-stop processes p. 84 Controlling memory access co...
متن کاملSupporting customized failure models for distributed software
The cost of employing software fault-tolerance techniques in distributed systems is strongly related to the type of failures to be tolerated. For example, in terms of the amount of redundancy required and execution time, tolerating a processor crash is much cheaper than tolerating arbitrary (or Byzantine) failures. The tradeoff, of course, is that making stronger assumptions about failures less...
متن کاملSubtleties in Tolerating Correlated Failures in Wide-area Storage Systems
High availability is widely accepted as an explicit requirement for distributed storage systems. Tolerating correlated failures is a key issue in achieving high availability in today’s wide-area environments. This paper systematically revisits previously proposed techniques for addressing correlated failures. Using several real-world failure traces, we qualitatively answer four important questi...
متن کاملEfficiently Tolerating Failures in Asynchronous Real-Time Distributed Systems
We present a proactive resource allocation algorithm, called BEA, for faulttolerant asynchronous real-time distributed systems. BEA considers an application model where trans-node application timeliness requirements are expressed using benefit functions, and anticipated workload during future time intervals are expressed using adaptation functions. Furthermore, BEA considers an adaptation model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Scalable Computing: Practice and Experience
دوره 6 شماره
صفحات -
تاریخ انتشار 2005